Description Logic Knowledge and Action Bases
نویسندگان
چکیده
Description logic Knowledge and Action Bases (KAB) are a mechanism for providing both a semantically rich representation of the information on the domain of interest in terms of a description logic knowledge base and actions to change such information over time, possibly introducing new objects. We resort to a variant of DL-Lite where UNA is not enforced and where equality between objects may be asserted and inferred. Actions are specified as sets of conditional effects, where conditions are based on epistemic queries over the knowledge base (TBox and ABox), and effects are expressed in terms of new ABoxes. In this setting, we address verification of temporal properties expressed in a variant of first-order μ-calculus with quantification across states. Notably, we show decidability of verification, under a suitable restriction inspired by the notion of weak acyclicity in data exchange.
منابع مشابه
Synthesizing and Executing Plans in Knowledge and Action Bases
We study plan synthesis for a variant of Knowledge and Action Bases (KABs). KABs have been recently introduced as a rich, dynamic framework where states are full-fledged description logic (DL) knowledge bases (KBs) whose extensional part is manipulated by actions that can introduce new objects from an infinite domain. We show that, in general, plan existence over KABs is undecidable even under ...
متن کاملExtracting ALEQR-Knowledge Bases from Graphs
A description graph is a directed graph that has labeled vertices and edges. This document proposes a method for extracting a knowledge base from a description graph. The technique is presented for the description logicALEQR which allows for conjunctions, primitive negation, existential restrictions, value restrictions, qualified number restrictions, existential self restrictions, and complex r...
متن کاملCut-Free ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALCI
We give the first direct cut-free ExpTime (optimal) tableau decision procedure, which is not based on transformation or on the precompletion technique, for checking satisfiability of a knowledge base in the description logic ALCI.
متن کاملA tableau calculus for a nonmonotonic extension of the Description Logic DL-Litecore
In this paper we introduce a tableau calculus for a nonmonotonic extension of the low complexity Description Logic DL-Litecore of the DL-Lite family. The extension, called DL-LitecTmin, can be used to reason about typicality and defeasible properties. The calculus performs a two-phase computation to check whether a query is minimally entailed from the initial knowledge base. It is sound, comple...
متن کاملPlan Synthesis for Knowledge and Action Bases
We study plan synthesis for a variant of Knowledge and Action Bases (KABs), a rich, dynamic framework, where states are description logic (DL) knowledge bases (KBs) whose extensional part is manipulated by actions that possibly introduce new objects from an infinite domain. We show that plan existence over KABs is undecidable even under severe restrictions. We then focus on state-bounded KABs, ...
متن کاملVerification of Inconsistency-Aware Knowledge and Action Bases
Description Logic Knowledge and Action Bases (KABs) have been recently introduced as a mechanism to evolve a DL KB over time by means of actions that may acquire new information from the external environment. Decidability of verification in KABs has been studied for properties expressed in first-order variants of μ-calculus, under a natural assumption of “run-boundedness”. However, the establis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Artif. Intell. Res.
دوره 46 شماره
صفحات -
تاریخ انتشار 2013